Brezis Pseudomonotonicity is Strictly Weaker than Ky–Fan Hemicontinuity
نویسندگان
چکیده
منابع مشابه
Coin Tossing is Strictly Weaker Than Bit Commitment
We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites between which special relativity guarantees a time lapse in communication. We show that, under these assumptions, unconditionally secure coin tossing can be carried out by exchanges of classical information. We show also, following Mayers, Lo and Chau, that unconditionall...
متن کاملExistential MSO over two successors is strictly weaker than over linear orders
As is well-known a language of finite words, considered as labeled linear orders, is definable in monadic second-order logic (MSO) iff it is definable in the existential fragment of MSO, that is the quantifier alternation hierarchy collapses. Even more, it does not make a difference if we consider existential MSO over a linear order or a successor relation only. In this note we show that somewh...
متن کاملGlobalization Is Weaker Than You Think
From 1980 to 2004, world trade in goods and services increased from 36 percent to 50 percent of world GDP. As the world experienced a surge in the trade of goods and services, it also saw a substantial rise in the trade of financial assets. The share of foreign equities in U.S. investors’ portfolios, for instance, increased from about 1 percent in the early 1980s to 12 percent in 2000.1 On that...
متن کاملCoin Tossing is Weaker than Bit Commitment
We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites. We show that, under these assumptions, unconditionally secure coin tossing can be carried out by exchanges of classical information. We show also, following Mayers, Lo and Chau, that unconditionally permanently secure bit commitment cannot be carried out by finitely many...
متن کاملStar-Free Picture Expressions are Strictly Weaker Than First-Order Logic
We exhibit a rst-order deenable picture language which we prove is not expressible by any star-free picture expression, i. e., it is not star-free. Thus rst-order logic over pictures is strictly more powerful than star-free picture expressions are. This is in sharp contrast with the situation with words: the well-known McNaughton-Papert theorem states that a word language is expressible by a rs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2018
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-018-1435-x